A factorization of the symmetric Pascal matrix involving the Fibonacci matrix

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

determinant of the hankel matrix with binomial entries

abstract in this thesis at first we comput the determinant of hankel matrix with enteries a_k (x)=?_(m=0)^k??((2k+2-m)¦(k-m)) x^m ? by using a new operator, ? and by writing and solving differential equation of order two at points x=2 and x=-2 . also we show that this determinant under k-binomial transformation is invariant.

15 صفحه اول

The Generalized Pascal Matrix via the Generalized Fibonacci Matrix and the Generalized Pell Matrix

In [4], the authors studied the Pascal matrix and the Stirling matrices of the first kind and the second kind via the Fibonacci matrix. In this paper, we consider generalizations of Pascal matrix, Fibonacci matrix and Pell matrix. And, by using Riordan method, we have factorizations of them. We, also, consider some combinatorial identities.

متن کامل

AN ALGORITHM FOR FINDING THE EIGENPAIRS OF A SYMMETRIC MATRIX

The purpose of this paper is to show that ideas and techniques of the homotopy continuation method can be used to find the complete set of eigenpairs of a symmetric matrix. The homotopy defined by Chow, Mallet- Paret and York [I] may be used to solve this problem with 2""-n curves diverging to infinity which for large n causes a great inefficiency. M. Chu 121 introduced a homotopy equation...

متن کامل

Matrix Powers of Column-justified Pascal Triangles and Fibonacci Sequences

It is known that if Ln, respectively Rn9 are n x n matrices with the (/, j ) * entry the binomial coefficient (y~l)? respectively (^l)), then Ln = In (mod 2), respectively R„=In (mod 2), where In is the identity matrix of dimension n>\ (see, e.g., Problem PI 073 5 in the May 1999 issue of Arner. Math Monthly). The entries of Ln form a left-justified Pascal triangle and the entries of Rn result ...

متن کامل

Symmetric Nonnegative Matrix Factorization for Graph Clustering

Nonnegative matrix factorization (NMF) provides a lower rank approximation of a nonnegative matrix, and has been successfully used as a clustering method. In this paper, we offer some conceptual understanding for the capabilities and shortcomings of NMF as a clustering method. Then, we propose Symmetric NMF (SymNMF) as a general framework for graph clustering, which inherits the advantages of N...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2007

ISSN: 0166-218X

DOI: 10.1016/j.dam.2007.06.024